Pattern Avoidability with Involution
نویسندگان
چکیده
منابع مشابه
Pattern Avoidability with Involution
An infinte word w avoids a pattern p with the involution θ if there is no substitution for the variables in p and no involution θ such that the resulting word is a factor of w. We investigate the avoidance of patterns with respect to the size of the alphabet. For example, it is shown that the pattern α θ (α)α can be avoided over three letters but not two letters, whereas it is well known that α...
متن کاملPattern avoidance with involution
We give the avoidance indices for all unary patterns with involution.
متن کاملAvoidability of circular formulas
Clark has defined the notion of n-avoidance basis which contains the avoidable formulas with at most n variables that are closest to be unavoidable in some sense. The family Ci of circular formulas is such that C1 = AA, C2 = ABA.BAB, C3 = ABCA.BCAB.CABC and so on. For every i 6 n, the n-avoidance basis contains Ci. Clark showed that the avoidability index of every circular formula and of every ...
متن کاملOn centralizers of prime rings with involution
Let $R$ be a ring with involution $*$. An additive mapping $T:Rto R$ is called a left(respectively right) centralizer if $T(xy)=T(x)y$ (respectively $T(xy)=xT(y)$) for all $x,yin R$. The purpose of this paper is to examine the commutativity of prime rings with involution satisfying certain identities involving left centralizers.
متن کاملAvoidability Index for Binary Patterns with Reversal
For every pattern p over the alphabet {x, y, x, y}, we specify the least k such that p is k-avoidable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.63.10